Genetic Design Method for Near-Optimal Training Sequences in Wideband Spatial Multiplexing Systems

نویسندگان

  • Toshiaki Koike
  • Hidekazu Murata
  • Susumu Yoshida
چکیده

Wireless communication systems that use multiple transmitting and receiving antennas have received a significant amount of attention. In these spatial multiplexing systems, by transmitting multiple co-channel signals simultaneously, the system capacity can be considerably increased especially in rich-scattering wireless channels. Over the last decade, many investigations into multiple-antenna systems have been reported. Signal processing in the receiver often requires channel state information (CSI) for spatial multiplexing systems. We can obtain CSI by sending known training sequences to the receiver. Since the residual channel estimation error seriously affects the error-rate performance, the design of good training sequences is important to realize highly spectrumefficient communications. This letter describes an efficient design method for superior training sequences that can obtain accurate CSI with a short training length. Several studies have been done on optimal training sequences for single antenna systems, as shown in examples [1], [2]. For multiple antenna systems, an analysis of the relationship between the achievable capacity and the training length is presented [3]. In [4], it is shown that optimal training sequences, which have perfect impulse-like auto-correlations and zero cross-correlations within a sliding window containing a number of the channel taps for estimation purposes, do not exist for all training lengths and constellation sizes. To construct optimal training sequences, an exhaustive search is required. Unfortunately, this is not practical due to the considerable amount of search space required, especially in spatial multiplexing systems

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application-Oriented Least Squares Experiment Design in Multicarrier Communication Systems

Recently, the application-oriented framework for pilot design in communication systems has been introduced. This framework is mostly appropriate for such a design since the training sequences are selected to optimize a final performance metric of interest and not some of the classical metrics quantifying the distance between the estimated model and the true one, e.g., the mean square error (MSE...

متن کامل

Selective Tone Reservation Method for PAPR Reduction of Spatially Multiplexed OFDM Systems

Tone Reservation (TR) is one of the well-known methods for PAPR reduction of Orthogonal Frequency Division Multiplexing (OFDM) systems. In this method some sub-carriers are reserved for PAPR reduction and the symbols in these sub-carriers are selected such that the PAPR of the OFDM frame is minimized. In this paper, the iterative algorithm introduced earlier for TR method in single antenna OFDM...

متن کامل

THE EFFECTS OF INITIAL SAMPLING AND PENALTY FUNCTIONS IN OPTIMAL DESIGN OF TRUSSES USING METAHEURISTIC ALGORITHMS

Although Genetic algorithm (GA), Ant colony (AC) and Particle swarm optimization algorithm (PSO) have already been extended to various types of engineering problems, the effects of initial sampling beside constraints in the efficiency of algorithms, is still an interesting field. In this paper we show that, initial sampling with a special series of constraints play an important role in the conv...

متن کامل

Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance

Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Transactions

دوره 88-B  شماره 

صفحات  -

تاریخ انتشار 2005